A symbolical algorithm on additive basis and double-loop networks
نویسندگان
چکیده
منابع مشابه
A symbolical algorithm on additive basis and double-loop networks
A double-loop digraph G=G(N ; s1; s2), with gcd(N; s1; s2)=1, has the set of vertices V =ZN and the adjacencies are given by u → u + si (mod N ) i = 1; 2. The diameter of G, denoted by D(N ; s1; s2), is known to be lower bounded by lb(N ) with D(N ) = min 16s1¡s2¡N; gcd(N;s1 ; s2)=1 D(N ; s1; s2)¿ ⌈√ 3N ⌉ − 2 = lb(N ): This lower bound is known to be sharp. For a 0xed N ∈N, some algorithms to 0...
متن کاملA complementary survey on double-loop networks
We give a survey on double-loop networks with emphasis on new development since the surveys in 1986, 1991 and 1995. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملAn efficient algorithm to find optimal double loop networks
The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e ~',, such that the digraph G(n; sl,s2) with set of vertices V = 7 / a n d adjacencies given by i ~...
متن کاملEquivalent Double - Loop Networks
Hwang and Xu defined equivalent double-loop networks and gave one such result showing that the L-shapes of the two equivalent networks are recombinations of three rectangles. Recently, Rödseth gave an elegant algebraic theorem for equivalent multi-loop networks. We show that its double-loop version yields equivalent networks of the 3rectangle version. We also show that other seemingly different...
متن کاملa head parameter survey on mazandarani dialect and its effect(s) on learning english from ca perspective (on the basis of x-bar syntax)1
there has been a gradual shift of focus from the study of rule systems, which have increasingly been regarded as impoverished, … to the study of systems of principles, which appear to occupy a much more central position in determining the character and variety of possible human languages. there is a set of absolute universals, notions and principles existing in ug which do not vary from one ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.006